Shift Registers Fool Finite Automata
نویسنده
چکیده
Let x be an m-sequence, a maximal length sequence produced by a linear feedback shift register. We show that the nondeterministic automatic complexity AN (x) is close to maximal: n/2 − AN (x) = O(log 2 n), whereas Hyde has shown AN (y) ≤ n/2 + 1 for all sequences y.
منابع مشابه
On Finite Automaton One-Key Cryptosystems
This paper reviews some works on finite automaton one-key cryptosystems and related topics such as autonomous finite automata and Latin arrays. It is well known that shift registers are important sequence generators in stream ciphers. But shift registers are merely a special kind of autonomous finite automata. Finite automata were considered as suitable mathematical models of cryptosystems from...
متن کاملA Finite Exact Representation of Register Automata Configurations
A register automaton is a finite automaton with finitely many registers ranging from an infinite alphabet. Since the valuations of registers are infinite, there are infinitely many configurations. We describe a technique to classify infinite register automata configurations into finitely many exact representative configurations. Using the finitary representation, we give an algorithm solving th...
متن کاملStream cipher using two dimensional Cellular Automata
The pseudo-random early in cryptography systems, the important of cellular automata has properties which are considered a state machine, high periods. two–dimensional cellular automata was used to avoid the limitation of the generated periods in the pseudo-random binary sequences such that used in linear shift Feedback registers (LFSR) , the binary sequences that are generated form CA generator...
متن کاملAn Improved Attack on the Shrinking Generator
This work proposes a known-plaintext attack on the Shrinking Generator through its characterization by means of Cellular Automata. It is based on the computation of the characteristic polynomials of sub-automata and on the generation of the Galois field associated to one of the Linear Feedback Shift Registers components of the generator. The proposed algorithm allows predicting a large number o...
متن کاملUsing Linear Hybrid Cellular Automata to Attack the Shrinking Generator
SUMMARY The aim of this research is the efficient cryptanalysis of the Shrinking Generator through its characterization by means of Linear Hybrid Cellular Automata. This paper describes a new known-plaintext attack based on the computation of the characteristic polynomials of sub-automata and on the generation of the Galois field associated to one of the Linear Feedback Shift Registers componen...
متن کامل